Program Transformation and Rewriting
ثبت نشده
چکیده
(nil) = nil sigperm(x :: xs) = append(sigrot(x; x); sigperm(xs)) sigrot(x; nil) = nil sigrot(u; x :: xs)) = cond(issig(u); u :: sigrot(rotate(u); xs); sigrot(rotate(u); xs)) 4.4 Third transformation step Our objective is to get rid of the costly occurrences of append in sigperm. We introduce the new denition: sr(x; y; u) = append(sigrot(x; y); u) and the theorem: The complete denition of sigperm is now: append(nil; x) = x append(x :: xs; y) = x :: append(xs; y) rotate(nil) = nil rotate(x :: xs) = append(xs; x :: nil) sigperm(nil) = nil sigperm
منابع مشابه
RAPT: A Program Transformation System Based on Term Rewriting
Chiba et al. (2005) proposed a framework of program transformation by template and automated verification of its correctness based on term rewriting. This paper describes a design and implementation of RAPT which implements this framework. RAPT transforms a term rewriting system according to a specified program transformation template. Presupposing the program transformation template is develop...
متن کاملStratego: A Language for Program Transformation based on Rewriting Strategies - System Description of Stratego 0.5
متن کامل
Automatic Validation of Transformation Rules for Java Verification Against a Rewriting Semantics
This paper presents a methodology for automatically validating program transformation rules that are part of a calculus for Java source code verification. We target the Java Dynamic Logic calculus which is implemented in the interactive prover of the KeY system. As a basis for validation, we take an existing SOS style rewriting logic semantics for Java, formalized in the input language of the M...
متن کاملA Term Rewriting Approach to Program Transformation by Templates
Huet and Lang (1978) presented a framework of automated program transformation based on lambda calculus in which programs are transformed according to a given program transformation template. They introduced a second-order matching algorithm of simply-typed lambda calculus to verify whether the input program matches the template. They also showed how to validate the correctness of the program t...
متن کاملComponentwise Program Construction: The Equivalent Transformation Computation Model versus the Logic Programming Model
In the equivalent transformation (ET) computation model, a program is a set of procedural rewriting rules for answer-preserving transformation of problems with respect to given background knowledge. In this paper, we discuss an approach to program construction by creating and accumulating individually correct and efficient program components one by one, referred to as componentwise program cons...
متن کاملA survey of strategies in rule-based program transformation systems
Program transformation is the mechanical manipulation of a program in order to improve it relative to some cost function and is understood broadly as the domain of computation where programs are the data. The natural basic building blocks of the domain of program transformation are transformation rules expressing a ‘one-step’ transformation on a fragment of a program. The ultimate perspective o...
متن کامل